New Improved Bounds for Reliability of Consecutive-k-out-of-n :f Systems
نویسنده
چکیده
New bounds are found for the reliability of consecutive-k-out-of-n:F systems with equal component failure probabilities. The expressions involved are simple, thus allowing a direct use in the derivation of theoretical properties. These bounds can also be employed in numerical computations when the value of n or k is so large that the exact calculation of the reliability is not achievable. Comparisons show that the approximation errors exhibited by these new formulas are lower than those of other widely used bounds. CONSECUTIVE K-OUT-OF-N :F SYSTEM, RELIABILITY, LOWER BOUND, UPPER BOUND, APPROXIMATION ERROR AMS 1991 SUBJECT CLASSIFICATION: PRIMARY 60C05 SECONDARY 60K10;90B25
منابع مشابه
Using NSGA II Algorithm for a Three Objectives Redundancy Allocation Problem with k-out-of-n Sub-Systems
in the new production systems, finding a way to improving the product and system reliability in design is a very important. The reliability of the products and systems may improve using different methods. One of this methods is redundancy allocation problem. In this problem by adding redundant component to sub-systems under some constraints, the reliability improved. In this paper we worked on ...
متن کاملLower bounds on the signed (total) $k$-domination number
Let $G$ be a graph with vertex set $V(G)$. For any integer $kge 1$, a signed (total) $k$-dominating functionis a function $f: V(G) rightarrow { -1, 1}$ satisfying $sum_{xin N[v]}f(x)ge k$ ($sum_{xin N(v)}f(x)ge k$)for every $vin V(G)$, where $N(v)$ is the neighborhood of $v$ and $N[v]=N(v)cup{v}$. The minimum of the values$sum_{vin V(G)}f(v)$, taken over all signed (total) $k$-dominating functi...
متن کاملNumber of Minimal Path Sets in a Consecutive-k-out-of-n: F System
In this paper the combinatorial problem of determining the number of minimal path sets of a consecutive-k-out-of-n: F system is considered. For the cases where k = 2, 3 the explicit formulae are given and for k ≥ 4 a recursive relation is obtained. Direct computation for determining the number of minimal path sets of a consecutive-k-out-of-n: F system for k ≥ 4 remains a difficult task. ...
متن کاملRedundancy allocation problem for k-out-of-n systems with a choice of redundancy strategies
To increase the reliability of a specific system, using redundant components is a common method which is called redundancy allocation problem (RAP). Some of the RAP studies have focused on k-out-of-n systems. However, all of these studies assumed predetermined active or standby strategies for each subsystem. In this paper, for the first time, we propose a k-out-of-<em...
متن کاملOn the Joint Reliability Importance for k-out-of-n Systems
In this paper, the concept of joint reliability importance (JRI) of two or groups of components in a coherent system with independent components have been studied. The JRI is defined as the rate at which the system reliability improves as the reliabilities of the two or groups of components improve. Generally, the sign and the value of the JRI represent the type and the degree of i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000